Capacitated Waste Collection Problem Solution Using an Open-Source Tool
نویسندگان
چکیده
Population in cities is growing worldwide, which puts the systems that offer basic services to citizens under pressure. Among these systems, Municipal Solid Waste Management System (MSWMS) also affected. collection and transportation first task an MSWMS, carried out traditionally most cases. This approach leads inefficient resource time expense since routes are prescheduled or defined upon drivers’ choices. The waste recognized as NP-hard problem can be modeled a Capacitated Collection Problem (CWCP). Despite good quality of works currently available literature, execution algorithms often forgotten, faster required increase feasibility solutions found. In this paper, we show performance open-source Google OR-Tools solve CWCP Bragança, Portugal (inland city). three metaheuristics tool were able reduce significantly cost associated with less than 2 s time. result obtained work proves applicability explored for problems considering bigger systems. Furthermore, fast response useful developing new platforms dynamic vehicle routing represent scenarios closer real one. We anticipate proven efficacy starting point developments toward applying optimization problems.
منابع مشابه
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...
متن کاملSolving an urban waste collection problem using ants heuristics
This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from traffic regulations. We prese...
متن کاملsolving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application
the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...
متن کاملTerrain Database Correlation Assessment Using an Open Source Tool
Configuring networked simulators for training military teams in a distributed environment requires the usage of a set of terrain databases to represent the same training area. The results of simulation exercises can be degraded if the terrain databases are poorly correlated. A number of methodologies for determining the correlation between terrain databases have been developed, by both governme...
متن کاملThe Open Capacitated Arc Routing Problem
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with positive demand under capacity constraints. This problem is related to the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not consider a depot, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers
سال: 2023
ISSN: ['2073-431X']
DOI: https://doi.org/10.3390/computers12010015